A survey of GNE computation methods: theory and algorithms
نویسنده
چکیده
This paper deals with optimization methods solving the generalized Nash equilibrium problem (GNEP), which extends the standard Nash problem by allowing constraints. Two cases are considered: general GNEPs where constraint functions are individualized and jointly convex GNEPs where there is a common constraint function. Most recent methods are benchmarked against new methods. Numerical illustrations are proposed with the same software for a fair benchmark.
منابع مشابه
A Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملDesign Software Failure Mode and Effect Analysis using Fuzzy TOPSIS Based on Fuzzy Entropy
One of the key pillars of any operating system is its proper software performance. Software failure can have dangerous effects and consequences and can lead to adverse and undesirable events in the design or use phases. The goal of this study is to identify and evaluate the most significant software risks based on the FMEA indices with respect to reduce the risk level by means of experts’ opini...
متن کاملروشهای مدل‌سازی تطوری در اقتصاد (با تاکید بر عناصر مشترک سازنده آنها)
In this paper we have tried mention to some sort of thewell-known evolutionary modeling approaches in economic territory such as Multi Agent simulations, Evolutionary Computation and Evolutionary Game Theory. As it has been mentioned in the paper, in recent years, the number of Evolutionary contributions applied to Multi-Agent models increased remarkably. However until now there is no consensus...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملA distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
In this paper, we propose a distributed primal-dual algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over network systems. In the considered game, not only each player’s local objective function depends on other players’ decisions, but also the feasible decision sets of all the players are coupled together with a globally shared affine inequality constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012